Bio-inspired Algorithms for TSP and Generalized TSP
نویسندگان
چکیده
The Traveling Salesman Problem (TSP) is to find a Hamiltonian tour of minimal length on a fully connected graph. The TSP is a NP-Complete, and there is no polynomial algorithm to find the optimal result. Many bio-inspired algorithms has been proposed to address this problem. Generally, generic algorithm (GA), ant colony optimization (ACO) and particle swarm optimization (PSO) are three typical bio-inspired algorithm for TSP. In this section we will give a brief introduction to the above three bio-inspired algorithms and their application to the TSP.
منابع مشابه
New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملACO-PSO Optimization for Solving TSP Problem with GPU Acceleration
In this paper, we present a novel approach named "ACO-PSO-TSPGPU" to run PSO and ACO on Graphical Processing Units (GPUs) and applied to TSP (Parallel-PSO&ACO-A-TSP). Both algorithms are implemented on GPUs. Well-known benchmark problems for many heuristic and meta heuristic algorithms presented by Travelling Salesman Problem (TSP) are known as NP hard complex problems.TSP was investigated usin...
متن کاملSolving TSP Using Various Meta-Heuristic Algorithms
Real world problems like Travelling Salesman Problem (TSP) belong to NP-hard optimization problems which are difficult to solve using classical mathematical methods. Therefore, many alternate solutions have been developed to find the optimal solution in shortest possible time. Nature-inspired algorithms are one of the proposed solutions which are successful in finding the solutions that are ver...
متن کاملParticle swarm optimization-based algorithms for TSP and generalized TSP
A novel particle swarm optimization (PSO)-based algorithm for the traveling salesman problem (TSP) is presented. An uncertain searching strategy and a crossover eliminated technique are used to accelerate the convergence speed. Compared with the existing algorithms for solving TSP using swarm intelligence, it has been shown that the size of the solved problems could be increased by using the pr...
متن کاملEvolving Strategies for Updating Pheromone Trails: A Case Study with the TSP
Ant Colony Optimization is a bio-inspired technique that can be applied to solve hard optimization problems. A key issue is how to design the communication mechanism between ants that allows them to effectively solve a problem. We propose a novel approach to this issue by evolving the current pheromone trail update methods. Results obtained with the TSP show that the evolved strategies perform ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012